Random Matrix Theory over Finite Fields

نویسنده

  • JASON FULMAN
چکیده

The first part of this paper surveys generating functions methods in the study of random matrices over finite fields, explaining how they arose from theoretical need. Then we describe a probabilistic picture of conjugacy classes of the finite classical groups. Connections are made with symmetric function theory, Markov chains, Rogers-Ramanujan type identities, potential theory, and various measures on partitions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Good random matrices over finite fields

The random matrix uniformly distributed over the set of all mby-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random matrices, is studied. It is shown that a k-good random m-by-n matrix with a distribution of minimum support size is uniformly distributed over a maximum-rank-dista...

متن کامل

Constructions of optimal LCD codes over large finite fields

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.

متن کامل

Properties of Sparse Random Matrices over Finite Fields

Typical properties of sparse random matrices over finite (Galois) fields are studied, in the limit of large matrices, using techniques from the physics of disordered systems. We present results for the average kernel dimension, the number of matrices for a given distribution of entries, and average dimension of the eigenvector spaces and the distribution of the eigenvalues. The significance of ...

متن کامل

Classical Wavelet Transforms over Finite Fields

This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...

متن کامل

A Stochastic Finite-element Method for Transformed Normal Random Parameter Fields

Transformed normal random fields are convenient models, e.g., for random material property fields obtained from microstructure analysis. In the context of the stochastic finite-element (FE) method, discretization of non-normal random fields by polynomial chaos expansions has been frequently employed. This introduces a non-linear relationship between the system matrix and normal random variables...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001